/*
 * @lc app=leetcode.cn id=77 lang=cpp
 *
 * [77] 组合
 */

// @lc code=start
class Solution
{
private:
    vector<int> path;
    vector<vector<int>> res;
    int index = 1;
    void backtracking()

public:
    vector<vector<int>> combine(int n, int k)
    {
        //回溯法学习
        backtracking(n, k, index);
        return res;
    }
};
// @lc code=end

